Zigzag Structure of Thin Chamber Complexes
نویسندگان
چکیده
منابع مشابه
Philosophical foundations for a zigzag theory structure
This paper describes a specific zigzag theory structure and relates its application to the information systems field. The foundations discussed are related to reality, knowledge, action and theory structure. The zigzag theory structure can be differentiated and used to describe task processes such as information systems development, and the use of information systems in business processes.
متن کاملChamber Complexes, Coxeter Systems, and Buildings
We provide a basic formal framework for the theory of chamber complexes and Coxeter systems, and for buildings as thick chamber complexes endowed with a system of apartments. Along the way, we develop some of the general theory of abstract simplicial complexes and of groups (relying on the group add class for the basics), including free groups and group presentations, and their universal proper...
متن کاملStructure and electronic properties of single–walled zigzag BN and B3C2N3 nanotubes using first-principles methods
The structure and the electronic properties of single-walled zigzag BN and B3C2N3 nanotubes (n, 0; n=4–10) were investigated using first-principles calculations based on a density functional theory. A plane–wave basis set with periodic boundary conditions in conjunction with Vanderbilt ultrasoft pseudo-potential was employed. The energy gap of ZB3C<su...
متن کاملZigzag codes and concatenated zigzag codes
This paper introduces a family of error-correcting codes called zigzag codes. A zigzag code is described by a highly structured zigzag graph. Due to the structural properties of the graph, very low-complexity soft-in/soft-out decoding rules can be implemented. We present a decoding rule, based on the Max-Log-APP (MLA) formulation, which requires a total of only 20 addition-equivalent operations...
متن کاملConnectivity of chamber graphs of buildings and related complexes
Let ∆ be a finite building (or, more generally, a thick spherical and locally finite building). The chamber graph G(∆), whose edges are the pairs of adjacent chambers in ∆, is known to be q-regular for a certain number q = q(∆). Our main result is that G(∆) is q-connected in the sense of graph theory. Similar results are proved for the chamber graphs of Coxeter complexes and for order complexes...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete & Computational Geometry
سال: 2017
ISSN: 0179-5376,1432-0444
DOI: 10.1007/s00454-017-9954-z